منابع مشابه
Computing Protected Circumscription
ABSTRACT: This paper deals with computing circumscription in the case of Horn data with additional protection (indefinite data), an intermediate investigation between Reiter’s result on predicate completion and Lifschitz’s efforts to make general (formula) circumscription more efficient as a computational tool. Reiter has shown a close tie between McCarthy’s circumscription and Clark’s predicat...
متن کاملComputing Circumscription
Circumscription is a transformation of predicate formulas proposed by John McCarthy for the purpose of formalizing non-monotonic aspects of commonsense reasoning. Circumscription is difficult to implement because its definition involves a second-order quantifier. This paper presents metamathematical results that allow us in some cases to replace circumscription by an equivalent first-order form...
متن کاملComputing Circumscription Revisited 2991
In recent years, a great deal of attention has been devoted to logics of common-sense reasoning. Among the candidates proposed, circumscription has been perceived as an elegant mathematical technique for modeling non-monotonic reasoning, but diicult to apply in practice. The major reason for this is the second-order nature of circumscription axioms and the diiculty in nding proper substitutions...
متن کاملComputing Circumscription Revisited: Preliminary Report
We provide a general method which can be used in an algorithmic manner to reduce certain classes of 2nd-order circumscription axioms to logically equivalent 1st order formulas The algorithm takes as input an arbitrary 2nd-order formula and either returns as output an equivalent 1st order formula, or terminates wi th failure In addition to demonstrating the algor i thm by applying it to various ...
متن کاملImplementing Prioritized Circumscription by Computing Disjunctive Stable Models
The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz’ parallel circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1985
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(85)80002-9